A bundle-free implicit programming approach for a class of elliptic MPECs in function space

A generalized implicit enumeration algorithm for a class of integer nonlinear programming problems

Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...

Some local fixed point results under $C$-class functions with applications to coupled elliptic systems

The main objective of the paper is to state newly fixed point theorems for set-valued mappings in the framework of 0-complete partial metric spaces which speak about a location of a fixed point with respect to an initial value of the set-valued mapping by using some $C$-class functions. The results proved herein generalize, modify and unify some recent results of the existing literature. As an ...

Existence of three solutions for a class of quasilinear elliptic systems involving the $p(x)$-Laplace operator

The aim of this paper is to obtain three weak solutions for the Dirichlet quasilinear elliptic systems on a bonded domain. Our technical approach is based on the general three critical points theorem obtained by Ricceri.

A Note on Smoothing Mathematical Programs with Equilibrium Constraints

Mathematical programs with equilibrium constrains (MPECs) in which the constraints are defined by a parametric variational inequality are considered. Recently, nonlinear programming solvers have been used to solve MPECs. Smoothing algorithms have been very successful. In this note, a smoothing approach based on neural network function to solve MPECs is proposed. The performance of the proposed ...

The Nehari Manifold for a Class of Indefinite Weight Semilinear Elliptic Equations